Excluded checkerboard colourable ribbon graph minors
نویسندگان
چکیده
Motivated by the Eulerian ribbon graph minors, in this paper we introduce notion of checkerboard colourable minors for graphs and its dual: bipartite graphs. abstract graphs, another i.e. join are also introduced. Using these then give excluded minor characterizations classes plane
منابع مشابه
Excluded Minors and the Ribbon Graphs of Knots
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible with the graph minor relation. We discuss excluded minor characterisations of m...
متن کاملExcluded Minors for [ 2 , 3 ] - Graph Planarity
A Kuratowski-type approach for [2,3]-graphs, i.e. hypergraphs the cardinality of whose edges not more than 3, is presented, leading to a well-quasi-order in such a context, with a complete obstruction set of six forbidden hypergraphs to plane embedding. A Kuratowski-type result is presented for finite hypergraphs, the cardinality of whose edges is not more than 3. Motivation goes back to [1, 2]...
متن کاملA characterization of some graph classes using excluded minors
In this article we present a structural characterization of graphs without K5 and the octahedron as a minor. We introduce semiplanar graphs as arbitrary sums of planar graphs, and give their characterization in terms of excluded minors. Some other excluded minor theorems for 3-connected minors are shown.
متن کاملRibbon graph minors and low-genus partial duals
We give an excluded minor characterisation of the class of ribbon graphs that admit partial duals of Euler genus at most one. Mathematics Subject Classification (2010). Primary 05C83, 05C10.
متن کاملDomination, Packing and Excluded Minors
Let γ(G) be the domination number of a graph G, and let αk(G) be the maximum number of vertices in G, no two of which are at distance ≤ k in G. It is easy to see that γ(G) ≥ α2(G). In this note it is proved that γ(G) is bounded from above by a linear function in α2(G) if G has no large complete bipartite graph minors. Extensions to other parameters αk(G) are also derived.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.112992